On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One
نویسندگان
چکیده
It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not, as in each of its computations, the initial component and the successor components are still chosen nondeterministically. Here we study CD-systems of stateless deterministic restarting automata with window size 1 that are themselves completely deterministic. In fact, we consider two such types of CDsystems, the strictly deterministic systems and the globally deterministic systems.
منابع مشابه
CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.
متن کاملOn CD-systems of stateless deterministic R-automata with window size one
Here we study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power...
متن کاملOn Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we present a construction that yields an equivalent NFA of size 2 from a stateless deterministic ordered restarting automaton that works on a...
متن کاملOn Stateless Multihead Finite Automata and Multihead Pushdown Automata
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all head...
متن کاملA Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata
Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols. However, the witness language for the nth level of the hierarchy is over an input alphabet with 2(n−1) elements. In this paper, we improve this result by showing that a binary alphabet is sufficient to establish this hierarchy. As a con...
متن کامل